Applicability of Formal Synthesis Illustrated via Scheduling

This paper describes a novel technique for formal synthesis and exempliies the main ideas using the high level synthesis task | scheduling. The novelty of the approach is based on the fact, that arbitrary scheduling algorithms can be embedded within a formal framework to automatically achieve guaranteed correct implementations. Two realistic examples are used to emphasize its applicability and it can be seen that the additional costs for formal synthesis are almost negligible in practice. We achieve the same quality for the implementations as conventional synthesis plus the proof of their correctness.